Kolmogorov complexity and cellular automata classification
نویسندگان
چکیده
منابع مشابه
Kolmogorov complexity and cellular automata classification
We present a new approach to cellular automata (CA for short) classification based on algorithmic complexity. We construct a parameter κ which is based only on the transition table of CA and measures the “randomness” of evolutions; κ is better, in a certain sense, than any other parameter recursively definable on CA tables. We investigate the relations between the classical topological approach...
متن کاملKolmogorov Complexity and Cellular Automata Classiication Ecole Normale Supérieure De Lyon Kolmogorov Complexity and Cellular Automata Classiication Kolmogorov Complexity and Cellular Automata Classiication
We present a new approach to cellular automata (CA for short) classiica-tion based on algorithmic complexity. We construct a parameter which is based only on the transition table of CA and measures the \randomness" of evolutions; is better, in a certain sense, than any other parameter deened on rule tables. We investigate the relations between the classical approach based on topology and ours b...
متن کاملCellular Automata Complexity Threshold and Classification: A Geometric Perspective
This paper presents the results of mathematical experiments on the socalled !orientation vector." It looks at complexity in terms of three perspectives: Wolfram, Langton, and Chua. Critically, we consider Chua#s geometrical complexity index and a complexity-based classification of elementary cellular automata. Ideas in terms of solutions for ordinary differential equations and complexity measur...
متن کاملCellular automata and communication complexity
The model of cellular automata is fascinating because very simple local rules can generate complex global behaviors. The relationship between local and global function is subject of many studies. We tackle this question by using results on communication complexity theory and, as a by-product, we provide (yet another) classification of cellular automata.
متن کاملTransients, cycles, and complexity in cellular automata.
An elementary context in which the computing ability of cellular automata is directly related to quantities of physical signiicance is discussed. It is found in examples that no single statistic serves to measure the complexity of the behaviors produced. On this basis it is argued that the theory of distributions can be gainfully employed alongside computation theory and information theory in t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2001
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(00)00012-8